A Predicate Transformer for Choreographies
نویسندگان
چکیده
Abstract Construction and analysis of distributed systems is difficult; choreographic programming a deadlock-freedom-by-construction approach to simplify it. In this paper, we present new theory programming. It supports for the first time: construction that require decentralised decision making (i.e., if/while-statements with multiparty conditions); provide not only deadlock freedom but also functional correctness pre/postcondition reasoning). Both contributions are enabled by single technique, namely predicate transformer choreographies.
منابع مشابه
Reasoning about Composition: A Predicate Transformer Approach
As interest in components and composition-related methods is growing rapidly, it is not always clear what the goals (and the corresponding difficulties) actually are. If composition is to become central in the future of software engineering, we need to better identify the fundamental issues that are related to it, before we attempt to solve them as they occur in object-oriented systems or in co...
متن کاملA Predicate Transformer Semantics for a Concurrent Language of Refinement
Circus is a combination of Z and CSP; its chief distinguishing feature is the inclusion of the ideas of the refinement calculus. Our main objective is the definition of refinement methods for concurrent programs. The original semantic model for Circus is Hoare and He’s unifying theories of programming. In this paper, we present an equivalent semantics based on predicate transformers. With this ...
متن کاملA predicate transformer for the progressproperty ` to - always ' Rutger
The temporal property`to-always' has been proposed for specifying progress properties of concurrent programs. Although thèto-always' properties are a subset of thèleads-to' properties for a given program, `to-always' has more convenient proof rules and in some cases more accurately describes the desired system behavior. In this paper, we give a predicate transformer wta, derive some of its prop...
متن کاملA Predicate/State Transformer Semantics for Bayesian Learning
This paper establishes a link between Bayesian inference (learning) and predicate and state transformer operations from programming semantics and logic. Specifically, a very general definition of backward inference is given via first applying a predicate transformer and then conditioning. Analogously, forward inference involves first conditioning and then applying a state transformer. These def...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-99336-8_19